Single Machine Predictive Scheduling Using Inserted Idle Times
نویسندگان
چکیده
منابع مشابه
Single Machine Inserted Idle Time Scheduling with Release Times and Due Dates
The single machine scheduling problem is considered in which each task has a release dates, a processing time and a due date. The objective is to mimimize the maximum lateness. Preemption is not allowed. Scheduling problem 1|rj |Lmax is a NP-hard problem. We define an IIT (inserted idle time) schedule as a feasible schedule in which a processor is kept idle at a time when it could begin process...
متن کاملOn Non-Preemptive Scheduling of Recurring Tasks Using Inserted Idle Times
We consider the problem of non-preemptively scheduling periodic and sporadic task systems on one processor using inserted idle times. For periodic task systems, we prove that the decision problem of determining whether a periodic task system is schedulable for all start times with respect to the class of algorithms using inserted idle times is NP-Hard in the strong sense, even when the deadline...
متن کاملFlowshop Scheduling with Respect to Machine Idle Times
We consider a variant of no-wait flowshop scheduling that is motivated by continuous casting in the multistage production process in steel manufacturing. The task is to find a feasible schedule with a minimum number of interruptions, i.e., continuous idle time intervals on the last production stage. Based on an interpretation as Eulerian Extension Problems, we fully settle the complexity status...
متن کاملSingle machine scheduling with forbidden start times
This paper addresses a single machine scheduling problem in which the following simple constraint is added: a set of time slots is forbidden for starting a task, that is no task can start at any forbidden time point. We show that the single machine problem with makespan minimization is strongly NP-complete and we give polynomial algorithms to solve the problems with a small number of forbidden ...
متن کاملScheduling with Inserted Idle Time: Problem Taxonomy and Literature Review
In the context of production scheduling, inserted idle time (IIT) occurs whenever a resource is deliberately kept idle in the face of waiting jobs. IIT schedules are particularly relevant in multimachine industrial situations where earliness costs and=or dynamically arriving jobs with due dates come into play. We provide a taxonomy of environments in which IIT scheduling is relevant, review the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2014
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2014/304808